Multiway Netlist Partitioning onto FPGA-based Board Architectures

نویسندگان

  • U. Ober
  • M. Glesner
چکیده

FPGAs are well accepted as an alternative to ASICs and for rapid prototyping purposes. Netlists of designs which are too large to be implemented on a single FPGA, have to be mapped onto a set of FPGAs, which could be organized on an FPGA board containing various FPGAs connected by interconnection networks. This paper presents an efficient approach to the problem of multiway partitioning of large FPGA netlists onto heterogeneous FPGA boards. To optimize the resulting partitioning with respect to the target architecture, our algorithm is able to consider the board architecture.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Optimized Design Flow for Fast FPGA-Based Rapid Prototyping

In this paper, we present an optimized design flow to map Register-Transfer-Level (RTL) netlists onto multiple-FPGA architectures. Our FPGA-dedicated method fully exploits design structure by letting the basic design steps technology mapping, hierarchical partitioning, floorplanning and signal flow driven placement, interact. This efficiently reduces runtime and yields design implementations of...

متن کامل

Interconnect Synthesis for Reconfigurable Multi-FPGA Architectures

Most reconngurable multi-fpga architectures have a pro-grammable interconnection network that can be reconngured to implement diierent interconnection patterns between the fpgas and memory devices on the board. Partitioning tools for such architectures must produce the necessary pin-assignments and interconnect connguration stream that correctly implement the partitioned design. We call this pr...

متن کامل

Multiway partitioning via geometric embeddings, orderings, and dynamic programming

AbstructThis paper presents effective algorithms for multiway partitioning. Confirming ideas originally due to Hall, we demonstrate that geometric embeddings of the circuit netlist can lead to high-quality k-way partitionings. The netlist embeddings are derived via the computation of d eigenvectors of the Laplacian for a graph representation of the netlist. As Hall did not specify how to partit...

متن کامل

Interconnection Architecture model of the Architecture Configuration Stream Configurable Inputs

Most reconngurable multi-fpga architectures have a programmable interconnection network that can be reconngured to implement diierent interconnection patterns between the fpgas and memory devices on the board. Partitioning tools for such architectures must produce the necessary pin-assignments and interconnect connguration stream that correctly implement the partitioned design. We call this pro...

متن کامل

TIMING AWARE PARTITIONING FOR MULTI-FPGA BASED LOGIC SIMULATION USING TOP-DOWN SELECTIVE FLATTENING A Thesis by SUBRAMANIAN POOTHAMKURISSI SWAMINATHAN

Timing Aware Partitioning for Multi-FPGA Based Logic Simulation Using Top-down Selective Flattening. (August 2012) Subramanian Poothamkurissi Swaminathan, B.Tech., National Institute of Technology, Trichy, India Chair of Advisory Committee: Dr. Sunil P. Khatri In order to accelerate logic simulation, it is highly beneficial to simulate the circuit design on FPGA hardware. However, limited hardw...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1995